Interactive Ray Tracing of Massive and Deformable Models
نویسندگان
چکیده
Christian Lauterbach: Interactive Ray Tracing of Massive and Deformable Models. (Under the direction of Dinesh Manocha.) Ray tracing is a fundamental algorithm used for many applications such as computer graphics, geometric simulation, collision detection and line-of-sight computation. Even though the performance of ray tracing algorithms scales with the model complexity, the high memory requirements and the use of static hierarchical structures pose problems with massive models and dynamic data-sets. We present several approaches to address these problems based on new acceleration structures and traversal algorithms. We introduce a compact representation for storing the model and hierarchy while ray tracing triangle meshes that can reduce the memory footprint by up to 80%, while maintaining high performance. As a result, can ray trace massive models with hundreds of millions of triangles on workstations with a few gigabytes of memory. We also show how to use bounding volume hierarchies for ray tracing complex models with interactive performance. In order to handle dynamic scenes, we use refitting algorithms and also present highly-parallel GPU-based algorithms to reconstruct the hierarchies. In practice, our method can construct hierarchies for models with hundreds of thousands of triangles at interactive speeds. Finally, we demonstrate several applications that are enabled by these algorithms. Using deformable BVH and fast data parallel techniques, we introduce a geometric sound propagation algorithm that can run on complex deformable scenes interactively and orders of magnitude faster than comparable previous approaches. In addition, we also use these hierarchical algorithms for fast collision detection between deformable models and GPU rendering of shadows on massive models by employing our compact representations for hybrid ray tracing and rasterization.
منابع مشابه
Strategies for Bounding Volume Hierarchy Updates for Ray Tracing of Deformable Models
In this paper, we describe strategies for bounding volume hierarchy updates for ray tracing of deformable models. By using pre-built hierarchy structures and a lazy evaluation technique for updating the bounding volumes, the hierarchy reconstruction can be made very efficiently. Experiments show that for deforming triangle meshes the reconstruction time of the bounding volume hierarchies per fr...
متن کاملReduceM: Interactive and Memory Efficient Ray Tracing of Large Models
We present a novel representation and algorithm, ReduceM, for memory efficient ray tracing of large scenes. ReduceM exploits the connectivity between triangles in a mesh and decomposes the model into triangle strips. We also describe a new stripification algorithm, Strip-RT, that can generate long strips with high spatial coherence. Our approach uses a two-level traversal algorithm for ray-prim...
متن کاملAn Efficient Algorithm for General 3D-Seismic Body Waves (SSP and VSP Applications)
Abstract The ray series method may be generalized using a ray centered coordinate system for general 3D-heterogeneous media. This method is useful for Amplitude Versus Offset (AVO) seismic modeling, seismic analysis, interpretational purposes, and comparison with seismic field observations.For each central ray (constant ray parameter), the kinematic (the eikonal) and dynamic ray tracing system ...
متن کاملAsynchronous BVH Construction for Ray Tracing Dynamic Scenes
Recent developments have produced several techniques for interactive ray tracing of dynamic scenes. In particular, bounding volume hierarchies (BVHs) are efficient acceleration structures that handle complex triangle distributions and can accommodate deformable scenes by updating (refitting) the bounding primitive without restructuring the entire tree. Unfortunately, updating only the bounding ...
متن کاملFast, parallel, and asynchronous construction of BVHs for ray tracing animated scenes
Recent developments have produced several techniques for interactive ray tracing of dynamic scenes. In particular, bounding volume hierarchies (BVHs) are efficient acceleration structures that handle complex triangle distributions and can accommodate deformable scenes by updating (refitting) the bounding primitive without restructuring the entire tree. Unfortunately, updating only the bounding ...
متن کامل